Optimal bicycle trip impediments resolution by data fusion

We propose a method, whose purpose is to combine set of GPS traces collected by bicyclists with notifications problematic situations determine an optimal action plan for solving safety related problems in traffic network. In particular, we use optimization which problem locations resolve under given budget constraint order maximize the number impediment free trips. The method aims suggest priority impediments resolve, would be manually infeasible. proposed consists two steps. First, are clustered, where each cluster corresponds so-called impediment. Each associated trips nearby using distance function. trip partitioned matching largest its affecting impediments. Solving all such part induces cost and makes free. second step find that can solved maximum A branch-and-bound optimizer presented evaluated. clustering parameters affect identified extent them. evaluate sensitivity result technique consistently estimate resolution cost. Our study support interactive urban designer improve bicycle road infrastructure. By providing prioritize between it also contribute safer more attractive situation bicyclists.